Pivot-and-Fix; A Mixed Integer Programming Primal Heuristic
نویسندگان
چکیده
Pivot-and-Fix, a new primal heuristic for finding feasible solutions for mixed integer programming (MIP) problems is presented in this paper. Pivot-and-Fixtries to explore potentially promising extreme points of the polyhedron of the problem and by forming smaller serach trees looks for integer feasible solutions. Computational results show that this heuristic could help MIP solvers to perform faster.
منابع مشابه
Randomized Rounding: A Primal Heuristic for General Mixed Integer Programming Problems
We propose an algorithm for generating feasible solutions to general mixed-integer programming problems. Computational results demonstrating the effectiveness of the heuristic are given. The source code is available as a heuristic in the COIN-OR Branch Cut Solver at www.coin-or.org
متن کاملHybrid Enumeration Strategies for Mixed Integer Programming
In this paper we present several algorithms which combine a partial enumeration with meta-heuristics for the solution of general mixed-integer programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this integration, and test them using a set of well-known benchmark problems. Key-words: Enumeration, L...
متن کاملOptimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
متن کاملShift-and-Propagate
For mixed integer programming, recent years have seen a growing interest in the design of general purpose primal heuristics for use inside complete solvers. Many of these heuristics rely on an optimal LP solution. Finding this may itself take a significant amount of time. The presented paper addresses this issue by the introduction of the Shift-and-Propagate heuristic. Shift-and-Propagate is a ...
متن کامل